Nonequilibrium behaviors of the three-dimensional Heisenberg model in the Swendsen-Wang algorithm
نویسندگان
چکیده
منابع مشابه
Dynamic Critical Behavior of the Swendsen–Wang Algorithm for the Three-Dimensional Ising Model
We have performed a high-precision Monte Carlo study of the dynamic critical behavior of the Swendsen–Wang algorithm for the three-dimensional Ising model at the critical point. For the dynamic critical exponents associated to the integrated autocorrelation times of the “energy-like” observables, we find zint,N = zint,E = zint,E ′ = 0.459 ± 0.005 ± 0.025, where the first error bar represents st...
متن کاملSwendsen-Wang Algorithm on the Mean-Field Potts Model
We study the q-state ferromagnetic Potts model on the n-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation for the ferromagnetic Potts model to recolor large sets of vertices in one step and potentially overcomes obstacles that inhibit single-site Glauber dynamics. The ...
متن کاملDynamic Critical Behavior of the Swendsen–Wang Algorithm: The Two-Dimensional 3-State Potts Model Revisited
We have performed a high-precision Monte Carlo study of the dynamic critical behavior of the Swendsen–Wang algorithm for the two-dimensional 3state Potts model. We find that the Li–Sokal bound (τint,E ≥ const × CH) is almost but not quite sharp. The ratio τint,E/CH seems to diverge either as a small power (≈ 0.08) or as a logarithm.
متن کاملSwendsen–Wang Algorithm: The Two-Dimensional 3-State Potts Model Revisited
We have performed a high-precision Monte Carlo study of the dynamic critical behavior of the Swendsen–Wang algorithm for the two-dimensional 3state Potts model. We find that the Li–Sokal bound (τint,E ≥ const × CH) is almost but not quite sharp. The ratio τint,E/CH seems to diverge either as a small power (≈ 0.08) or as a logarithm.
متن کاملBayesian variable selection and the Swendsen-Wang algorithm
The need to explore model uncertainty in linear regression models with many predictors has motivated improvements in Markov chain Monte Carlo sampling algorithms for Bayesian variable selection. Traditional sampling algorithms for Bayesian variable selection may perform poorly when there are severe multicollinearities amongst the predictors. In this paper we describe a new sampling method based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2016
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.93.012101